A Retrograde Approximation Algorithm for One-Player Can't Stop

نویسندگان

  • James Glenn
  • Haw-ren Fang
  • Clyde P. Kruskal
چکیده

A one-player, finite, probabilistic game with perfect information can be presented as a bipartite graph. For one-player Can’t Stop, the graph is cyclic and the challenge is to determine the game-theoretical values of the positions in the cycles. In this article we prove the existence and uniqueness of the solution to one-player Can’t Stop, and give an efficient approximation algorithm to solve it by incorporating Newton’s method with retrograde analysis. We give results of applying this method to small versions of one-player Can’t Stop.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Retrograde Approximation Algorithm for Multi-player Can't Stop

An n-player, finite, probabilistic game with perfect information can be presented as a 2n-partite graph. For Can’t Stop, the graph is cyclic and the challenge is to determine the game-theoretical values of the positions in the cycles. We have presented our success on tackling one-player Can’t Stop and two-player Can’t Stop. In this article we study the computational solution of multi-player Can...

متن کامل

A Retrograde Approximation Algorithm for Two-Player Can’t Stop

A two-player, finite, probabilistic game with perfect information can be presented as a four-partite graph. For Can’t Stop, the graph is cyclic and the challenge is to determine the game-theoretical values of the positions in the cycles. In a previous paper we have presented our success on tackling one-player Can’t Stop. In this paper we prove the existence and uniqueness of the solution to two...

متن کامل

A Generalized Heuristic for Can't Stop

Can’t Stop is a jeopardy stochastic game played on an octagonal game board with four six-sided dice. Optimal strategies have been computed for some simplified versions of Can’t Stop by employing retrograde analysis and value iteration combined with Newton’s method. These computations result in databases that map game positions to optimal moves. Solving the original game, however, is infeasible ...

متن کامل

Prediction of Driver’s Accelerating Behavior in the Stop and Go Maneuvers Using Genetic Algorithm-Artificial Neural Network Hybrid Intelligence

Research on vehicle longitudinal control with a stop and go system is presently one of the most important topics in the field of intelligent transportation systems. The purpose of stop and go systems is to assist drivers for repeatedly accelerate and stop their vehicles in traffic jams. This system can improve the driving comfort, safety and reduce the danger of collisions and fuel consumption....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006